1850D - Balanced Round - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define ll long long
#define pb push_back
#define fast_cin()                    \
	ios_base::sync_with_stdio(false); \
	cin.tie(NULL);

// You Need to Calm Down 

void solve()
{
    int n,k;
    cin>>n>>k;

    vector<int> arr(n);

    for(int i=0;i<n;i++)
    {
        cin>>arr[i];
    }
    sort(arr.begin(),arr.end());
    int maxx = 1;
    int cnt = 1;

    for(int i=1;i<n;i++)
    {
        if(arr[i] - arr[i-1] <= k)
            cnt++;
        else
        {
            maxx = max(maxx,cnt);
            cnt = 1;
        }
        if(i == n-1)
            maxx = max(maxx,cnt);
    }

    int remov = n-maxx;
    cout<<remov<<"\n";    
}


int main()
{
    fast_cin();
    int t;
    cin>>t;
    
    while(t--)
    {
        solve();
    }
    return 0;
}